Mathematical formulation and an improved moth–flame optimization algorithm for parallel two-sided disassembly line balancing based on fixed common stations

Abstract Nowadays, rapid product iterations result in large quantities of end-of-life products. To meet the fast-growing demand for remanufacturing engineering, companies have quickened standardization and industrialization waste dissembling. Two-sided disassembly lines can effectively disassemble large-sized products on both sides lines, parallel multiple simultaneously with fewer workstations higher production efficiency. Combining two types increase efficiency However, two-sided line has not been fully investigated because essential complexity problem. Therefore, this research introduced balancing problem fixed common stations. First, a multi-objective mixed-integer programming model is established to solve first time. The proved be correct through small-scale numerical examples. Second, improved moth–flame optimization algorithm implemented proposed large-scale problems. employs two-phase decoding approach design scheme discrete moth fire operation search replace new individuals, then restart strategy reduce probability population falling into local optimum. Finally, solved extensive problems different layouts, including straight-line, two-sided, case studies demonstrated reliability validity method.